From X to Pi; Representing the Classical Sequent Calculus in the Pi-calculus

نویسندگان

Steffen van Bakel

Luca Cardelli

Maria Grazia Vigliotti

چکیده

We study the π-calculus, enriched with pairing and non-blocking input, and define a notion of type assignment that uses the type constructor →. We encode the circuits of the calculus X into this variant of π, and show that all reduction (cut-elimination) and assignable types are preserved. Since X enjoys the Curry-Howard isomorphism for Gentzen’s calculus LK, this implies that all proofs in LK have a representation in π.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Classical Cut - elimination in the π - calculus ( In memory of

We define the calculus LK a variant of the calculus X that enjoys the Curry-Howard correspondence for Gentzen’s calculus lk; the variant consists of allowing arbitrary progress of cut over cut. We study the π-calculus enriched with pairing, for which we define a notion of implicative type assignment. We translate the terms of LK into this variant of π, and show that reduction and assignable typ...

متن کامل

A Static Analysis of the Applied Pi Calculus

We present in this technical report a non-uniform static analysis for detecting the term-substitution property in systems specified in the language of the applied pi calculus. The analysis implements a denotational framework that has previously introduced analyses for the pi calculus and the spi calculus. The main novelty of this analysis is its ability to deal with systems specified in languag...

متن کامل

Stochastic Reasoning in Hybrid Linear Logic

Ordinary linear implication can represent unconstrained state transition, but stateful systems often operate under temporal and stochastic constraints which impede the use of linear logic as a framework for representing stateful computations. We propose a general modal extension of linear logic where the worlds represent the constraints, and hybrid connectives combine constraint reasoning with ...

متن کامل

A Complete Proof System for a Dynamic Epistemic Logic Based upon Finite pi-Calculus Processes

The pi-calculus process algebra describes the interaction of concurrent and communicating processes. In this paper we present the syntax and semantics of a dynamic epistemic logic for multi-agent systems, where the epistemic actions are finite processes in the pi-calculus. We then extend the language to include actions from a specified set of action structures. We define a proof system for the ...

متن کامل